Measures of Distinctness for Random Partitions and Compositions of an Integer
نویسندگان
چکیده
منابع مشابه
The number of distinct part sizes of some multiplicity in compositions of an Integer. A probabilistic Analysis
Random compositions of integers are used as theoretical models for many applications. The degree of distinctness of a composition is a natural and important parameter. A possible measure of distinctness is the number X of distinct parts (or components). This parameter has been analyzed in several papers. In this article we consider a variant of the distinctness: the number X m of distinct parts...
متن کاملDistinctness of compositions of an integer: A probabilistic analysis
Compositions of integers are used as theoretical models for many applications. The degree of distinctness of a composition is a natural and important parameter. In this article, we use as measure of distinctness the number of distinct parts (or components). We investigate, from a probabilistic point of view, the first empty part, the maximum part size and the distribution of the number of disti...
متن کاملCorrections to the results derived in "A Unified Approach to Algorithms Generating Unrestricted and Restricted Integer Compositions and Integer Partitions"'; and a comparison of four restricted integer composition generation algorithms
In this note, I discuss results on integer compositions/partitions given in the paper “A Unified Approach to Algorithms Generating Unrestricted and Restricted Integer Compositions and Integer Partitions”. I also experiment with four different generation algorithms for restricted integer compositions and find the algorithm designed in the named paper to be pretty slow, comparatively. Some of my ...
متن کاملNormal Convergence for Random Partitions with Multiplicative Measures
Let Pn be the space of partitions of integer n ≥ 0, P the space of all partitions, and define a class of multiplicative measures induced by Fβ(z) = ∏ k(1 − zk)k β with β > −1. Based on limit shapes and other asymptotic properties studied by Vershik, we establish normal convergence for the size and parts of random partitions.
متن کاملm-compositions and m-partitions: exhaustive generation and Gray code
In this paper we give an exhaustive generation algorithm for the class of m-compositions of integers with fixed m. Moreover we define a Gray code to list these combinatorial objects according to a particular order. Finally, we define m-partitions, which are an m-dimensional generalization of integer partitions, and an exhaustive generation algorithm for m-partitions, based on the same ideas use...
متن کامل